Irregularities of partitions

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

On Irregularities of Distribution

§

Irregularities of Distribution, Ii

(1.2) \D[zu ..., zn ; B(x, r)]\ > c2(K, e). n < Note that the exponent {\ — (1/2K) e) of n is essentially the best possible: (2 — (1/2K) e) cannot be replaced by the exponent (2 — (1/2K) + e) with e > 0. Note further that (1.1) or (1.2) above guarantees the existence of a ball in U with 'error' very large as compared to that of boxes in U with sides parallel to the axes. We recall that in 1954 ...

On Irregularities of Distribution Iii

Dedicated to the memory of Gerold Wagner Abstract We study the L w -norm (2 < W < oo) of the discrepancy of a sequence of points in the unit cube relative to similar copies of a given convex polygon. In particular, we prove the rather surprising result that the estimates obtained have the same order of magnitude as the analogous question when the sequence of points is replaced by a set of point...

Note on Irregularities of Distribution